Eventual Leader Election in Evolving Mobile Networks
نویسندگان
چکیده
Many reliable distributed services rely on an eventual leader election to coordinate actions. The eventual leader detector has been proposed as a way to implement such an abstraction. It ensures that, eventually, each process in the system will be provided by an unique leader, elected among the set of correct processes in spite of crashes and uncertainties. A number of eventual leader election protocols were suggested. Nonetheless, as far as we are aware of, no one of these protocols tolerates a free pattern of node mobility. This paper proposes a new protocol for this scenario of dynamic and mobile unknown networks.
منابع مشابه
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults ...
متن کاملStabilizing token schemes for population protocols
In this paper we address the stabilizing token circulation and leader election problems in population protocols model augmented with oracles. Population protocols is a recent model of computation that captures the interactions of biological systems. In this model emergent global behavior is observed while anonymous finite-state agents(nodes) perform local peer interactions. Uniform self-stabili...
متن کاملDesign and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks
Leader election is a very important problem, not only in wired networks, but in mobile, ad hoc networks as well. Existing solutions to leader election do not handle frequent topology changes and dynamic nature of mobile networks. In this paper, we present a leader election algorithm that is highly adaptive to arbitrary (possibly concurrent) topological changes and is therefore well-suited for u...
متن کاملAnalysis and Enhancements of Leader Elections algorithms in Mobile Ad Hoc Networks
Mobile Ad Hoc networks (MANET), distinct from traditional distributed systems, are dynamic and selforganizing networks. MANET requires a leader to coordinate and organize tasks. The challenge is to have the right election algorithm that chooses the right leader based on various factors in MANET. In this paper, we analyze four leader election algorithms used in mobile Ad Hoc Networks. Factors co...
متن کاملAn Election Algorithm to Ensure the High Availability of Leader in Large Mobile Ad Hoc Networks∗
A fundamental problem of distributed systems, leader election, is presented in the context of mobile ad hoc networks (MANETs). In many distributed systems, the presence of a leader is necessary in order to monitor underlying computations, guarantee quality functioning, take checkpoints, generate the lost token, detect quiescence conditions, etc. Hence, several leader election algorithms have be...
متن کامل